A polynomial time interior–point path–following algorithm for LCP based on Chen–Harker–Kanzow smoothing techniques

$$O\sqrt{n}L$$ ); otherwise, the complexity bound is O(nL). The relations between our search direction and the one used in the standard interior-point algorithm are also discussed. Received September 9, 1996 / Revised version received December 22, 1997? Published online March 16, 1999     

Error bounds of two smoothing approximations for semi-infinite minimax problems

In the paper we investigate smoothing method for solving semi-infinite minimax problems. Not like most of the literature in semi-infinite minimax problems which are concerned with the continuous time version（i.e., the one dimensional semi-infinite minimax problems）, the primary focus of this paper is on multi- dimensional semi-infinite minimax problems. The global error bounds of two smoothing approximations for the objective function are given and compared. It is proved that the smoothing approximation given in this paper can provide a better error bound than the existing one in literature.     

Directed vertex-connectivity augmentation

Received August 1995 / Revised version received January 1997 Published online March 16, 1999     

The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2

Laigle-Chapuy constructed a class of permutation polynomials over a finite field of characteristic 2, which includes several other known classes. In this paper, we determine the compositional inverses of all Laigle-Chapuy's permutation polynomials. Our method is based on a direct sum decomposition of the finite field.     

Finite Differences and Orthogonal Polynomials

By combining finite differences with symmetric functions, we present an elementary demonstration for the limit relation from Laguerre to Hermite polynomials, proposed by Richard Askey. Another limit relation between these two polynomials will also be established.     

Coloring complexes and arrangements

Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs. Similar results are obtained for characteristic polynomials of submatroids of type ℬ _n arrangements. The first author was supported by NSF grant DMS-0500638. The second author was supported by NSF grant DMS-0245623.     

Robust designs for models with possible bias and correlated errors

This paper studies the model-robust design problem for general models with an unknown bias or contamination and the correlated errors. The true response function is assumed to be from a reproducing kernel Hilbert space and the errors are fitted by the qth order moving average process MA（q）, especially the MA（1） errors and the MA（2） errors. In both situations, design criteria are derived in terms of the average expected quadratic loss for the least squares estimation by using a minimax method. A case is studied and the orthogonality of the criteria is proved for this special response. The robustness of the design criteria is discussed through several numerical examples.     

具有十个大振幅极限环的五次多项式系统

本文研究一类五次平面多项式系统赤道极限环分支问题.运用奇点量方法,首次证明了五次多项式系统可在赤道分支出十个极限环.     

Partial duality and Bollobás and Riordan’s ribbon graph polynomial

Recently S. Chmutov introduced a generalization of the dual of a ribbon graph (or equivalently an embedded graph) and proved a relation between Bollobás and Riordan’s ribbon graph polynomial of a ribbon graph and of its generalized duals. Here I show that the duality relation satisfied by the ribbon graph polynomial can be understood in terms of knot theory and I give a simple proof of the relation which used the homfly polynomial of a knot.